Adaptive message-passing decoding: ways to implement and limits of applicability
نویسندگان
چکیده
I n this report we study the decoding algorithms for a family of codes called LDPC codes used over the binary erasure channel (BEC). LDPC codes are able to work at rates near Shannon capacity with linear time decoding algorithms. Those linear time decoding algorithms sometimes fail even when Gaussian elimination would still be able to restore the codeword. In this report we try to experimentally test a novel way of decoding LDPC codes over BEC and to analyse its performance.
منابع مشابه
Message-Passing Decoding on Self-dual F4-additive Codes
In this thesis we work with message-passing decoding on self-dual F4-additive codes. We present and disprove the a decoding scheme proposed by Parker et al. in an unpublished manuscript [17]. We refer to this scheme as Embedded Factor Graph decoding. The method of Discriminative decoding is developed and described in this work as a replacement for the embedded decoding. It is shown to be exact ...
متن کاملCoordination Approach to Find Best Defense Decision with Multiple Possibilities among Robocup Soccer Simulation Team
In 2D Soccer Simulation league, agents will decide based on information and data in their model. Effective decisions need to have world model information without any noise and missing data; however, there are few solutions to omit noise in world model data; so we should find efficient ways to reduce the effect of noise when making decisions. In this article we evaluate some simple solutions whe...
متن کاملNew Iterative Decoding Algorithms for Low-Density Parity-Check (LDPC) Codes
Low-Density Parity-Check (LDPC) codes have gained lots of popularity due to their capacity achieving/approaching property. This work studies the iterative decoding also known as message-passing algorithms applied to LDPC codes. Belief propagation (BP) algorithm and its approximations, most notably min-sum (MS), are popular iterative decoding algorithms used for LDPC and turbo codes. The thesis ...
متن کاملA general lower bound on the decoding complexity of sparse-graph codes
Historically, the discovery of new code families and decoding algorithms has been followed by fundamental limits on their required complexity. To arrive at such limits, it is necessary to have general models that capture the essence of the approach to decoding, while still allowing for the possibility of as yet undiscovered families of codes. By adapting sphere-packing arguments used earlier in...
متن کاملGraph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords...
متن کامل